The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation
نویسندگان
چکیده
We describe a new access method, the hB”-tree, an adaptation of the hB-tree index to the constraints of the II-tree . The II-trees, a generalization of the Blink-trees, provide high concurrency with recovery, because they break down structure modification into a series of short atomic actions. In addition, the IItrees include a node consolidation algorithm. The hB-tree is, a multi-attribute index which is highly insensitive to dimensionality, but which has no node consolidation algorithm and has a flaw in its split/post algorithm in certain special cases. The hB”-tree corrects the splitting/posting algorithm and adapts the concurrency, recovery and node consolidation of the II-tree to the hB-tree. The combination makes the hBn-tree suitable for inclusion in a general purpose database management system.supporting multi-attribute and spatial queries. keywords: indexing, B-trees, multi-attribute access methods, spatial access methods, concurrency, recovery
منابع مشابه
The hBΠ-tree: A Concurrent and Recoverable Multi-attribute Access Method
We describe a new access method, the hBΠ-tree, an adaptation of the Lomet and Salzberg hB-tree index to the constraints of their Π-tree . The Π-trees, a generalization of the Blink-trees of Lehman and Yao, provide very high concurrency with recovery, hence permitting highly parallel access to data. The hB-tree is a multi-attribute index which is highly insensitive to dimensionality. The combina...
متن کاملThe Performance of the hB - pi Tree
The hB-pi tree is a multi-attribute index method which combines the hB tree, a multi-attribute access structure and the II-tree, an abstract index with efficient concurrency and recovery methods. The hB-pi tree is a balanced tree and adapts well to different data distributions. Furthermore, the hB-pi tree inherits the efficient concurrency and recovery methods from the II tree. This paper provi...
متن کاملAutomatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملA Framework for Supporting the Class of Space Partitioning
Emerging database applications require the use of new indexing structures beyond B-trees and R-trees. Examples are the k-D tree, the trie, the quadtree, and their variants. They are often proposed as supporting structures in data mining, GIS, and CAD/CAM applications. A common feature of all these indexes is that they recursively divide the space into partitions. A new extensible index structur...
متن کاملRestructuring the concurrent B+-tree with non-blocked search operations
Database systems frequently establish the B-tree style indexes for fast access to data records. Since the B-tree index could be a performance bottleneck, many concurrent algorithms have been proposed to improve concurrency of B-tree accesses. In this paper we propose a new concurrent Bþ-tree algorithm that provides high concurrency and an efficient tree restructuring method. As the proposed met...
متن کامل